A Semantics for Logic Programs based on First Order Hereditary Harrop Formulas
نویسندگان
چکیده
The paper introduces a semantics for logic programs based on rst order hereditary Harrop formulas which are expressed in terms of intuitionistic derivations. The derivations are constructed by means of an intuitionistic proof procedure that constitutes the resolution mechanism of the language. The semantics of a program is a goal independent denotation which can be equivalently speciied by a denota-tional and an operational semantics. The denotational semantics is deened using a set of primitive semantic operators that act on derivations and are directly related to the properties of the derivations.
منابع مشابه
A Semantics for Logic Programs Based on Hereditary Harrop Formulas
We present a semantic framework for logic programs based on first-order hereditary Harrop formulas. The denotational and operational semantics are defined in a uniform way by characterizing some basic algebraic operators, which are directly related to the syntactic structure of the language. This allows us to address problems such as the relation between the operational semantics and the denota...
متن کاملA New Execution Model for the logic of hereditary Harrop formulas
The class of first-order Hereditary Harrop formulas (fohh) is a well-established extension of first-order Horn clauses. Its operational semantics is based on intuitionistic provability. We propose another operational semantics for fohh which is based on game semantics. This new semantics has several interesting aspects: in particular, it gives a logical status to the read predicate. keywords: i...
متن کاملFormalizing Two Fixed Point Semantics for HH(C)
The scheme HH(C) emerged as a double extension of traditional Logic Programming. On one hand, extending Horn logic to hereditary Harrop formulas (HH ), in order to improve the expressive power; on the other, incorporating constraints, in order to increase the efficiency. The behavior of such extended CLP programs was explained by means of a sequent calculus that, from every program and set of c...
متن کاملA Proposal for Modules in λProlog: Preliminary Draft
Higher-order hereditary Harrop formulas, the underlying logical foundation of λProlog [20], are more expressive than first-order Horn clauses, the logical foundation of Prolog. In particular, various forms of scoping and abstraction are supported by the logic of higher-order hereditary Harrop formulas while they are not supported by first-order Horn clauses. Various papers have argued that the ...
متن کاملHigher-Order Logic Programming Languages with Constraints: A Semantics
A Kripke Semantics is defined for a higher-order logic programming language with constraints, based on Church’s Theory of Types and a generic constraint formalism. Our syntactic formal system, hoHH(C) (higher-order hereditary Harrop formulas with constraints), which extends λProlog’s logic, is shown sound and complete. A Kripke semantics for equational reasoning in the simply typed lambda-calcu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998